Minimal Cardinality Diagnosis in Problems with Multiple Observations
نویسندگان
چکیده
منابع مشابه
Distributed Diagnosis by using a Condensed Local Representation of the Global Diagnoses with Minimal Cardinality
The set of diagnoses is commonly calculated in consistency based diagnosis, where a diagnosis includes a set of faulty components. In some applications, the search for diagnoses is reduced to the set of diagnoses with minimal cardinality. In distributed systems, local diagnoses are calculated in each agent, and global diagnoses are calculated for the complete system. The key contribution in the...
متن کاملCounting Complexity of Minimal Cardinality and Minimal Weight Abduction
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. We have recently started to study the counting complexity of propositional abduction. However, several important cases have been left open, n...
متن کاملMinimal Instances of Database Schemes with Additive Cardinality Constraints
In the entity-relationship approach to database design, integrity constraints are used to express database semantics. Cardinality constraints are a frequently used way of imposing restrictions to the structure of the databases. In this paper, we consider additive cardinality constraints which specify lower and upper bounds on the total number of relationships an entity of a xed type may be invo...
متن کاملSolving Siphons with the Minimal Cardinality for Deadlock Control
By modifying the objective function and adding new constraints to a Mixed Integer Programming (MIP) method proposed by Park and Reveliotis, this chapter presents a Revised MIP (RMIP) method to directly solve siphons, called smart siphons, with the minimal cardinality as well as the minimal number of resource places. Accordingly, a proper Control Place (CP) is added for each smart siphon in orde...
متن کاملMaximum Cardinality Search for Computing Minimal Triangulations
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Diagnostics
سال: 2021
ISSN: 2075-4418
DOI: 10.3390/diagnostics11050780